Dialectical Characterization of Consistent Query Explanation with Existential Rules

نویسندگان

  • Abdallah Arioua
  • Madalina Croitoru
چکیده

This paper provides a dialectical characterization of IAR and Brave semantics via argumentation dialogue. We propose a minimal argumentation dialogue system and investigate the relation between its outcome and these semantics. We show that Brave semantics corresponds to a dialogue where the opponent of the Brave-entailed query wins in any dialogue. We show also that IAR semantics corresponds to a dialogue where the proponent of the IAR-entailed query wins any dialogue. We further investigate how the profile (i.e. behavior) of the participants impacts the outcome of the dialogue and the entailment of queries.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Empirical Evaluation of Argumentation in Explaining Inconsistency-Tolerant Query Answering

In this paper we answer empirically the following research question: “Are dialectical explanation methods more effective than one-shot explanation methods for Intersection of Closed Repairs inconsistency tolerant semantics in existential rules knowledge bases?” We ran two experiments with 84 and respectively 38 participants and showed that under certain conditions dialectical approaches are sig...

متن کامل

Formalizing and Studying Dialectical Explanations in Inconsistent Knowledge Bases. (Formalisation et Etude des Explications Dialectiques dans les Bases de Connaissances Incohérentes)

Knowledge bases are deductive databases where the machinery of logic is used to represent domain-specific and general-purpose knowledge over existing data. In the existential rules framework, a knowledge base is composed of two layers: the data layer which represents the factual knowledge, and the ontological layer that incorporates rules of deduction and negative constraints. The main reasonin...

متن کامل

Query Answering with Inconsistent Existential Rules under Stable Model Semantics

Traditional inconsistency-tolerent query answering in ontology-based data access relies on selecting maximal components of an ABox/database which are consistent with the ontology. However, some rules in ontologies might be unreliable if they are extracted from ontology learning or written by unskillful knowledge engineers. In this paper we present a framework of handling inconsistent existentia...

متن کامل

Generalized Consistent Query Answering under Existential Rules

Previous work has proposed consistent query answering as a way to resolve inconsistencies in ontologies. In these approaches to consistent query answering, however, only inconsistencies due to errors in the underlying database are considered. In this paper, we additionally assume that ontological axioms may be erroneous, and that some database atoms and ontological axioms may not be removed to ...

متن کامل

The Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules

We give the complete picture of the complexity of conjunctive query answering under (weakly-)(frontier-)guarded disjunctive existential rules, i.e., existential rules extended with disjunction, and their main subclasses, linear rules and inclusion dependencies.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016